Toward computability of trace distance discord
نویسندگان
چکیده
منابع مشابه
Finite-temperature scaling of trace distance discord near criticality in spin diamond structure
In this work we explore the quantum correlation quantified by trace distance discord as a measure to analyze the quantum critical behaviors in the Ising-XXZ diamond structure at finite temperatures. It is found that the first-order derivative of the trace distance discord exhibits a maximum around the critical point at finite temperatures. By analyzing the finite-temperature scaling behavior, w...
متن کاملGeometric quantum discord with Bures distance
We define a new measure of quantum correlations in bipartite quantum systems given by the Bures distance of the system state to the set of classical states with respect to one subsystem, that is, to the states with zero quantum discord. Our measure is a geometrical version of the quantum discord. As the latter it quantifies the degree of non-classicality in the system. For pure states it is ide...
متن کاملToward a Theory of Intrinsic Computability
This paper investigates the foundations of the view that (i) computation theory is a special branch of dynamical systems theory, and (ii) a computational system is a special kind of discrete dynamical system whose specific property, being computational, can be thought to be intrinsic to the dynamics of the system itself. I give a formal explication of the concept of an intrinsic computational s...
متن کاملTrace distance measure of coherence
We show that trace distance measure of coherence is a strong monotone for all qubit and, so called, X states. An expression for the trace distance coherence for all pure states and a semi definite program for arbitrary states is provided. We also explore the relation between l1-norm and relative entropy based measures of coherence, and give a sharp inequality connecting the two. In addition, it...
متن کاملSemi-computability of the Fréchet distance between surfaces
The Fréchet distance is a distance measure for parameterized curves or surfaces. Using a discrete approximation, we show that for triangulated surfaces it is upper semi-computable, i.e., there is a non-halting Turing machine which produces a monotone decreasing sequence of rationals converging to the result. It follows that the decision problem, whether the Fréchet distance of two given surface...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: New Journal of Physics
سال: 2014
ISSN: 1367-2630
DOI: 10.1088/1367-2630/16/1/013038